Pragmatic Graph Rewriting Modifications

Using Graph Rewriting to Specify Software Architectural Transformations

In order to understand, analyze and possibly modify software, we commonly examine and manipulate its architecture. For example, we may want to examine the architecture at different levels of abstraction or repair the architecture if it has deviated from our mental model of the software. We can view such manipulations as architectural transformations, and more specifically, as graph transformati...

Visual Specification of a DSL Processor Debugger

Graph rewriting-based model transformation is an essential tool to process graph-based visual models. If the execution of transformations is not supported by the continuous presentation of the modifications performed on the model, the traceability and the debugging of transformations becomes difficult. Recent modeling tools usually support the definition of rewriting rules based transformations...

Non-simplifying Graph Rewriting Termination

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky’s work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those stru...

Complete Growth Series of Coxeter Groups with more than Three Generators

Speeding up Graph Transformation through Automatic Concatenation of Rewrite Rules

The execution of graph transformations is sped up by automatically concatenating rewrite rules. We start by guessing which elements are already matched or created by one rule, and are re-used by the following rule afterwards. Then, we build a rule that combines the modifications of both rules, leaving out unneccesary intermediate steps. We use such combined rules to transform graph rewrite sequ...